<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>Navo Portable Library: 大小平衡树</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body onload='searchBox.OnSelectItem(0);'>
<!-- 制作者 Doxygen 1.7.3 -->
<script type="text/javascript"><!--
var searchBox = new SearchBox("searchBox", "search",false,'搜索');
--></script>
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">Navo Portable Library&#160;<span id="projectnumber">Ver 1.0.20120827</span></div>
   <div id="projectbrief">Provides generic platform independent facilities.</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>首页</span></a></li>
      <li><a href="modules.html"><span>模块</span></a></li>
      <li><a href="annotated.html"><span>数据结构</span></a></li>
      <li><a href="files.html"><span>文件</span></a></li>
      <li id="searchli">
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="搜索" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
</div>
<div class="header">
  <div class="summary">
<a href="#nested-classes">数据结构</a> &#124;
<a href="#define-members">宏定义</a> &#124;
<a href="#typedef-members">类型定义</a> &#124;
<a href="#func-members">函数</a>  </div>
  <div class="headertitle">
<h1>大小平衡树</h1>  </div>
<div class="ingroups"><a class="el" href="group___xE4_xBA_x8C_xE5_x8F_x89_xE6_xA0_x91.html">二叉树</a></div></div>
<div class="contents">
<table class="memberdecls">
<tr><td colspan="2"><h2><a name="nested-classes"></a>
数据结构</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="struct____sblnk__node.html">__sblnk_node</a></td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">大小平衡树节点  <a href="struct____sblnk__node.html#_details">更多...</a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsblnk__root.html">sblnk_root</a></td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">树根  <a href="structsblnk__root.html#_details">更多...</a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structsblnk__info.html">sblnk_info</a></td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">树信息表  <a href="structsblnk__info.html#_details">更多...</a><br/></td></tr>
<tr><td colspan="2"><h2><a name="define-members"></a>
宏定义</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga77426ccc7b1fb7bb23e58872fba730c2">SBLNK_ROOT</a>(name)&#160;&#160;&#160;<a class="el" href="structsblnk__root.html">sblnk_root</a> name = {NULL}</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">定义一个名为name的树根，并对其初始化  <a href="#ga77426ccc7b1fb7bb23e58872fba730c2"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga84848fd6b4aaa586f512407a61d41744">SBLNK_NODE</a>(name)&#160;&#160;&#160;<a class="el" href="struct____sblnk__node.html">sblnk_node</a> name = {NULL, NULL, NULL, 0}</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">定义一个名为name的节点，并对其初始化  <a href="#ga84848fd6b4aaa586f512407a61d41744"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gad0c44e99f672d370c01aaac8c695c4de">SBLNK_INFO</a>(name)&#160;&#160;&#160;<a class="el" href="structsblnk__info.html">sblnk_info</a> name = {0, 0, 0}</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">定义一个名为name的树信息表，并对其初始化  <a href="#gad0c44e99f672d370c01aaac8c695c4de"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ga8977419721a1b85610adb2634f136983"></a><!-- doxytag: member="大小平衡树::sblnk_inc" ref="ga8977419721a1b85610adb2634f136983" args="(itr)" -->
#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga8977419721a1b85610adb2634f136983">sblnk_inc</a>(itr)&#160;&#160;&#160;((itr) = sblnk_next(itr))</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">迭代器递增 <br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ga39f8da7ba1e44269c6ec1e7fb0125165"></a><!-- doxytag: member="大小平衡树::sblnk_dec" ref="ga39f8da7ba1e44269c6ec1e7fb0125165" args="(itr)" -->
#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga39f8da7ba1e44269c6ec1e7fb0125165">sblnk_dec</a>(itr)&#160;&#160;&#160;((itr) = sblnk_prev(itr))</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">迭代器递减 <br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="gabf3d458264ca15b1c03e37cdbfc12049"></a><!-- doxytag: member="大小平衡树::sblnk_inc_later" ref="gabf3d458264ca15b1c03e37cdbfc12049" args="(itr)" -->
#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gabf3d458264ca15b1c03e37cdbfc12049">sblnk_inc_later</a>(itr)&#160;&#160;&#160;__sblnk_inc_later(itr, &amp;(itr))</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">迭代器后自增 <br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ga348aac8583fc25ed39891d60d8790d63"></a><!-- doxytag: member="大小平衡树::sblnk_dec_later" ref="ga348aac8583fc25ed39891d60d8790d63" args="(itr)" -->
#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga348aac8583fc25ed39891d60d8790d63">sblnk_dec_later</a>(itr)&#160;&#160;&#160;__sblnk_dec_later(itr, &amp;(itr))</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">迭代器后自减 <br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga1d98dcdb6f4a7ed1ef8de3cf977c640f">sblnk_foreach</a>(_begin, _end, fn, type, member)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">正向遍历_begin到_end的节点，并为每一个节点调用回调函数或宏  <a href="#ga1d98dcdb6f4a7ed1ef8de3cf977c640f"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga65b3b2936facf1872cb83f0f13734740">sblnk_reverse_foreach</a>(_rbegin, _rend, fn, type, member)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">逆向遍历_begin到_end的节点，并为每一个节点调用回调函数或宏  <a href="#ga65b3b2936facf1872cb83f0f13734740"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaa132699dadc3b4d6cf77a99778d502f8">SBLNK_RECURSE_PROC</a>(name, type, param)&#160;&#160;&#160;void name(type * param)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">定义递归遍历回调函数  <a href="#gaa132699dadc3b4d6cf77a99778d502f8"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gac178eb532821851b0ccf99e70f89b857">sblnk_recurse_foreach</a>(root, fn, type, member)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">正向递归遍历整个树  <a href="#gac178eb532821851b0ccf99e70f89b857"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga0fe27927107ab630345681e6d37096c5">sblnk_recurse_reverse_foreach</a>(root, fn, type, member)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">逆向递归遍历整个树  <a href="#ga0fe27927107ab630345681e6d37096c5"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gac3f9e0c692066835cd57f562954e3d54">sblnk_search</a>(root, newly, greater, res, type, member)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">搜索树中的某个节点  <a href="#gac3f9e0c692066835cd57f562954e3d54"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga9610155afa17d2c85e71f9548e255f6c">sblnk_insert</a>(root, newly, greater, res, type, member)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">插入新节点  <a href="#ga9610155afa17d2c85e71f9548e255f6c"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga87d6d30a36e8688e2bbcc5c349dc4bd5">sblnk_serialize</a>(root, buf, type, member)&#160;&#160;&#160;__sblnk_serialize(root, (void**)(buf), offset_of(type, member))</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">将树进行序列化为一个有序序列  <a href="#ga87d6d30a36e8688e2bbcc5c349dc4bd5"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">#define&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga4bae9dc037366733482ee79511cbc2c4">sblnk_deserialize</a>(root, buf, cnt, type, member)&#160;&#160;&#160;__sblnk_deserialize(root, (char**)(buf), cnt, offset_of(type, member))</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">根据树的序列进行反序列化为一个完整的树  <a href="#ga4bae9dc037366733482ee79511cbc2c4"></a><br/></td></tr>
<tr><td colspan="2"><h2><a name="typedef-members"></a>
类型定义</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="gacd146cf1a43aedc708dd063d3c7c1d21"></a><!-- doxytag: member="大小平衡树::sblnk_node" ref="gacd146cf1a43aedc708dd063d3c7c1d21" args="" -->
typedef struct <a class="el" href="struct____sblnk__node.html">__sblnk_node</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gacd146cf1a43aedc708dd063d3c7c1d21">sblnk_node</a></td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">节点 <br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="gaed239b78d6bc2fb4207b3139dc046294"></a><!-- doxytag: member="大小平衡树::sblnk_iter" ref="gaed239b78d6bc2fb4207b3139dc046294" args="" -->
typedef struct <a class="el" href="struct____sblnk__node.html">__sblnk_node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaed239b78d6bc2fb4207b3139dc046294">sblnk_iter</a></td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">迭代器 <br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ga4af164439491a4ca79da044842819995"></a><!-- doxytag: member="大小平衡树::sblnk_pr1" ref="ga4af164439491a4ca79da044842819995" args=")(sblnk_node *)" -->
typedef int(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga4af164439491a4ca79da044842819995">sblnk_pr1</a> )(<a class="el" href="struct____sblnk__node.html">sblnk_node</a> *)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">单参数回调函数指针 <br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="gaa9b184f17ebd6de7ee301b2be4b40d50"></a><!-- doxytag: member="大小平衡树::sblnk_pr2" ref="gaa9b184f17ebd6de7ee301b2be4b40d50" args=")(sblnk_node *, sblnk_node *)" -->
typedef int(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaa9b184f17ebd6de7ee301b2be4b40d50">sblnk_pr2</a> )(<a class="el" href="struct____sblnk__node.html">sblnk_node</a> *, <a class="el" href="struct____sblnk__node.html">sblnk_node</a> *)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">双参数回调函数指针 <br/></td></tr>
<tr><td colspan="2"><h2><a name="func-members"></a>
函数</h2></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">NV_API size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gad792d3ec9e12043ac935238471075fd5">sblnk_distance</a> (<a class="el" href="struct____sblnk__node.html">sblnk_iter</a> first, <a class="el" href="struct____sblnk__node.html">sblnk_iter</a> last)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">计算两个节点的迭代距离  <a href="#gad792d3ec9e12043ac935238471075fd5"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">NV_API size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga85091b37cced90e27aace1ed466f15b9">sblnk_index_of</a> (<a class="el" href="structsblnk__root.html">sblnk_root</a> *root, <a class="el" href="struct____sblnk__node.html">sblnk_iter</a> itr)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">计算迭代器的正向索引  <a href="#ga85091b37cced90e27aace1ed466f15b9"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">NV_API size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gabe9efb0165493808f4e6896a70eda6de">sblnk_reverse_index_of</a> (<a class="el" href="structsblnk__root.html">sblnk_root</a> *root, <a class="el" href="struct____sblnk__node.html">sblnk_iter</a> itr)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">计算迭代器的逆向索引  <a href="#gabe9efb0165493808f4e6896a70eda6de"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">NV_API size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga0d2affd3956b699ba994f82a13b3cf2b">sblnk_depth</a> (<a class="el" href="structsblnk__root.html">sblnk_root</a> *root)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">计算树的深度  <a href="#ga0d2affd3956b699ba994f82a13b3cf2b"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">NV_API size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gab7ece6c8087440945d0a50d8cd81b423">sblnk_leafs</a> (<a class="el" href="structsblnk__root.html">sblnk_root</a> *root)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">计算树的叶子数  <a href="#gab7ece6c8087440945d0a50d8cd81b423"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">NV_API void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaf5442bb764fe7fd9ff8d796dff0551e0">sblnk_get_info</a> (<a class="el" href="structsblnk__root.html">sblnk_root</a> *root, <a class="el" href="structsblnk__info.html">sblnk_info</a> *info)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">获取树的信息，包括节点数、深度、叶子数  <a href="#gaf5442bb764fe7fd9ff8d796dff0551e0"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">NV_API void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga19c2e9e6ec1788d13f34c1f230b47d02">sblnk_maintain</a> (<a class="el" href="structsblnk__root.html">sblnk_root</a> *root, <a class="el" href="struct____sblnk__node.html">sblnk_node</a> *node, <a class="el" href="struct____sblnk__node.html">sblnk_node</a> *parent)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">插入节点后，对树进行调整  <a href="#ga19c2e9e6ec1788d13f34c1f230b47d02"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">NV_API void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga87e9e7a65a0850fb3b02455a2a9e54d2">sblnk_erase</a> (<a class="el" href="structsblnk__root.html">sblnk_root</a> *root, <a class="el" href="struct____sblnk__node.html">sblnk_node</a> *entry)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">移除某个节点  <a href="#ga87e9e7a65a0850fb3b02455a2a9e54d2"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">NV_API void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga9028bdd9eb8000ed59e1a512af48a37a">sblnk_erases</a> (<a class="el" href="structsblnk__root.html">sblnk_root</a> *root, <a class="el" href="struct____sblnk__node.html">sblnk_iter</a> begin, <a class="el" href="struct____sblnk__node.html">sblnk_iter</a> end, <a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga4af164439491a4ca79da044842819995">sblnk_pr1</a> erase_handler)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">移除区域内的节点  <a href="#ga9028bdd9eb8000ed59e1a512af48a37a"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gad68cb541128675d3c8a165e6d0d4d229">sblnk_init</a> (<a class="el" href="structsblnk__root.html">sblnk_root</a> *root)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">初始化树根  <a href="#gad68cb541128675d3c8a165e6d0d4d229"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga8b2053d41e14a1f256bbf06168ec97fe">sblnk_empty</a> (<a class="el" href="structsblnk__root.html">sblnk_root</a> *root)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">判断树是否为空  <a href="#ga8b2053d41e14a1f256bbf06168ec97fe"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ga15aa827c355d6b74177650a5bf0ba003"></a><!-- doxytag: member="大小平衡树::__sblnk_singular" ref="ga15aa827c355d6b74177650a5bf0ba003" args="(sblnk_node *root)" -->
static int&#160;</td><td class="memItemRight" valign="bottom"><b>__sblnk_singular</b> (<a class="el" href="struct____sblnk__node.html">sblnk_node</a> *root)</td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gabbfd4bc4031072dd875a16e2eef0e18c">sblnk_singular</a> (<a class="el" href="structsblnk__root.html">sblnk_root</a> *root)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">判断树是否只有单个节点  <a href="#gabbfd4bc4031072dd875a16e2eef0e18c"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga9ade2ee98cf812276ab751ead800e5bc">sblnk_serialable</a> (<a class="el" href="structsblnk__root.html">sblnk_root</a> *root)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">判断树是否可以序列化  <a href="#ga9ade2ee98cf812276ab751ead800e5bc"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="gaba95ad50292f4f70318301ff32cea16f"></a><!-- doxytag: member="大小平衡树::__sblnk_count" ref="gaba95ad50292f4f70318301ff32cea16f" args="(sblnk_node *root)" -->
static size_t&#160;</td><td class="memItemRight" valign="bottom"><b>__sblnk_count</b> (<a class="el" href="struct____sblnk__node.html">sblnk_node</a> *root)</td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga70443373b0ae8f6e9c8dbd01ab276d8b">sblnk_count</a> (<a class="el" href="structsblnk__root.html">sblnk_root</a> *root)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">获取树的节点总数  <a href="#ga70443373b0ae8f6e9c8dbd01ab276d8b"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static <a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gab12dea4f3e2f3ab2709e8c458056f6b2">sblnk_left</a> (<a class="el" href="struct____sblnk__node.html">sblnk_node</a> *node)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">得到左子节点  <a href="#gab12dea4f3e2f3ab2709e8c458056f6b2"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static <a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga2238721162bee093678cdd7aecb11990">sblnk_right</a> (<a class="el" href="struct____sblnk__node.html">sblnk_node</a> *node)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">得到右子节点  <a href="#ga2238721162bee093678cdd7aecb11990"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static <a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga2b84c86f24154173661a6b15a7f8392f">sblnk_parent</a> (<a class="el" href="struct____sblnk__node.html">sblnk_node</a> *node)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">得到父节点  <a href="#ga2b84c86f24154173661a6b15a7f8392f"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga2c8271615d973239ac49bc721263ffd4">sblnk_size</a> (<a class="el" href="struct____sblnk__node.html">sblnk_node</a> *node)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">得到节点的子树大小  <a href="#ga2c8271615d973239ac49bc721263ffd4"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga80e18a0fd09125d1fd04c420848adee6">sblnk_is_root</a> (<a class="el" href="struct____sblnk__node.html">sblnk_iter</a> itr)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">判断当前节点是否是根节点  <a href="#ga80e18a0fd09125d1fd04c420848adee6"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga279e84ec3fd30ebd6ab8a2bec720c320">sblnk_is_leaf</a> (<a class="el" href="struct____sblnk__node.html">sblnk_iter</a> itr)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">判断当前节点是否是叶子节点  <a href="#ga279e84ec3fd30ebd6ab8a2bec720c320"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaf89a0ca64b9f9d4c9ce25487e19f1267">sblnk_link</a> (<a class="el" href="struct____sblnk__node.html">sblnk_iter</a> newly, <a class="el" href="struct____sblnk__node.html">sblnk_iter</a> parent, <a class="el" href="struct____sblnk__node.html">sblnk_iter</a> *plink)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">链接两个节点  <a href="#gaf89a0ca64b9f9d4c9ce25487e19f1267"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga8b3e8e509ef35403fb8f80a7e9bba5fd">sblnk_set_size</a> (<a class="el" href="struct____sblnk__node.html">sblnk_node</a> *node, size_t size)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">设置当前节点子树大小域  <a href="#ga8b3e8e509ef35403fb8f80a7e9bba5fd"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga570d0615947869f006d217e1c5b68685">sblnk_set_parent_if</a> (<a class="el" href="struct____sblnk__node.html">sblnk_node</a> *node, <a class="el" href="struct____sblnk__node.html">sblnk_node</a> *parent)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">仅在node不为空时，设置node的父节点  <a href="#ga570d0615947869f006d217e1c5b68685"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gab1ec464fdb4d8c762425fc30448423f4">sblnk_node_init</a> (<a class="el" href="struct____sblnk__node.html">sblnk_node</a> *node)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">初始化节点  <a href="#gab1ec464fdb4d8c762425fc30448423f4"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga69c71476514321a8f598476d19a98881">sblnk_iter_replace</a> (<a class="el" href="structsblnk__root.html">sblnk_root</a> *root, <a class="el" href="struct____sblnk__node.html">sblnk_iter</a> victim, <a class="el" href="struct____sblnk__node.html">sblnk_iter</a> newly)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">用新节点替换旧节点  <a href="#ga69c71476514321a8f598476d19a98881"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaa1ba8199bbb594b59527ee4e8aa1adc4">sblnk_replace</a> (<a class="el" href="structsblnk__root.html">sblnk_root</a> *victim, <a class="el" href="structsblnk__root.html">sblnk_root</a> *newly)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">用新的树根替换旧树根  <a href="#gaa1ba8199bbb594b59527ee4e8aa1adc4"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaa043d0e47f0f41e427e86d0da566ae97">sblnk_swap</a> (<a class="el" href="structsblnk__root.html">sblnk_root</a> *a, <a class="el" href="structsblnk__root.html">sblnk_root</a> *b)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">交换两个树  <a href="#gaa043d0e47f0f41e427e86d0da566ae97"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">NV_API int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga196f18e5e1116a4b96e7dcee0d12db2f">sblnk_exist</a> (<a class="el" href="structsblnk__root.html">sblnk_root</a> *root, <a class="el" href="struct____sblnk__node.html">sblnk_iter</a> itr)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">判断一个节点是否存在于树中  <a href="#ga196f18e5e1116a4b96e7dcee0d12db2f"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static <a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga6a4cbf6a15d0b9d42017614238b1e0d9">sblnk_at</a> (<a class="el" href="structsblnk__root.html">sblnk_root</a> *root, size_t index)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">得到正向索引对应的节点的迭代器  <a href="#ga6a4cbf6a15d0b9d42017614238b1e0d9"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static <a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga93f0b4b21761403ead1bd49a0541b412">sblnk_reverse_at</a> (<a class="el" href="structsblnk__root.html">sblnk_root</a> *root, size_t index)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">得到逆向索引对应的节点的迭代器  <a href="#ga93f0b4b21761403ead1bd49a0541b412"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">NV_API <a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gac564d8aed1991fbf0c3f55bbb4edc709">sblnk_front</a> (<a class="el" href="structsblnk__root.html">sblnk_root</a> *root)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">得到树的最左端节点  <a href="#gac564d8aed1991fbf0c3f55bbb4edc709"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">NV_API <a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaef991ca0f842b85f5ac97941545c025e">sblnk_back</a> (<a class="el" href="structsblnk__root.html">sblnk_root</a> *root)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">得到树的最右端节点  <a href="#gaef991ca0f842b85f5ac97941545c025e"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static <a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaef5561f1a6e6865d29d001bb05b81d2f">sblnk_begin</a> (<a class="el" href="structsblnk__root.html">sblnk_root</a> *root)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">得到指向正向起始位置的迭代器  <a href="#gaef5561f1a6e6865d29d001bb05b81d2f"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static <a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gadb2f7b60f1f386ec7c25e5ad89ac5be2">sblnk_end</a> ()</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">得到指向正向终止位置的迭代器  <a href="#gadb2f7b60f1f386ec7c25e5ad89ac5be2"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static <a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga9deff7b11edfb7af28fa3e50455628bd">sblnk_end_of</a> (<a class="el" href="struct____sblnk__node.html">sblnk_iter</a> cur)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">得到当前迭代器的正向终止位置  <a href="#ga9deff7b11edfb7af28fa3e50455628bd"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static <a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga9d5419a171f3b9789e64620f24f122db">sblnk_rbegin</a> (<a class="el" href="structsblnk__root.html">sblnk_root</a> *root)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">得到指向逆向起始位置的迭代器  <a href="#ga9d5419a171f3b9789e64620f24f122db"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static <a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga1a03a537ea85b8ffdd4a8b889939df2e">sblnk_rend</a> ()</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">得到指向逆向终止位置的迭代器  <a href="#ga1a03a537ea85b8ffdd4a8b889939df2e"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static <a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga2f9706ee0e9db48af435fc2316ff8999">sblnk_rend_of</a> (<a class="el" href="struct____sblnk__node.html">sblnk_iter</a> cur)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">得到当前迭代器的逆向终止位置  <a href="#ga2f9706ee0e9db48af435fc2316ff8999"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">NV_API <a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga6bd50f36005fd9ae83c23d0446f79b90">sblnk_next</a> (<a class="el" href="struct____sblnk__node.html">sblnk_iter</a> cur)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">得到当前节点的中序后继节点  <a href="#ga6bd50f36005fd9ae83c23d0446f79b90"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">NV_API <a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga57c68614024a3a41fc416490d9be9f0e">sblnk_prev</a> (<a class="el" href="struct____sblnk__node.html">sblnk_iter</a> cur)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">得到当前节点的中序前驱节点  <a href="#ga57c68614024a3a41fc416490d9be9f0e"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">NV_API <a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga1bc124c75a57627dad7af5cff4588bdb">sblnk_advance</a> (<a class="el" href="struct____sblnk__node.html">sblnk_iter</a> cur, int dist)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">给迭代器增加一段距离或减小一段距离  <a href="#ga1bc124c75a57627dad7af5cff4588bdb"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga0c4657b6e570cc5db49102522b162a80">sblnk_clear</a> (<a class="el" href="structsblnk__root.html">sblnk_root</a> *root, <a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga4af164439491a4ca79da044842819995">sblnk_pr1</a> erase_handler)</td></tr>
<tr><td class="mdescLeft">&#160;</td><td class="mdescRight">清空树  <a href="#ga0c4657b6e570cc5db49102522b162a80"></a><br/></td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ga30f55e0b1823bba1a268137fff468f64"></a><!-- doxytag: member="大小平衡树::__sblnk_inc_later" ref="ga30f55e0b1823bba1a268137fff468f64" args="(sblnk_iter cur, sblnk_iter *p)" -->
static <a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td><td class="memItemRight" valign="bottom"><b>__sblnk_inc_later</b> (<a class="el" href="struct____sblnk__node.html">sblnk_iter</a> cur, <a class="el" href="struct____sblnk__node.html">sblnk_iter</a> *p)</td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ga2c5944b8ad45959e83693a369b9532df"></a><!-- doxytag: member="大小平衡树::__sblnk_dec_later" ref="ga2c5944b8ad45959e83693a369b9532df" args="(sblnk_iter cur, sblnk_iter *p)" -->
static <a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td><td class="memItemRight" valign="bottom"><b>__sblnk_dec_later</b> (<a class="el" href="struct____sblnk__node.html">sblnk_iter</a> cur, <a class="el" href="struct____sblnk__node.html">sblnk_iter</a> *p)</td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ga6201ee2be60e7c96ff1bfbb49b11ab50"></a><!-- doxytag: member="大小平衡树::__do_sblnk_recurse_foreach" ref="ga6201ee2be60e7c96ff1bfbb49b11ab50" args="(sblnk_iter cur, void(*fn)(void *), size_t offset)" -->
NV_API void&#160;</td><td class="memItemRight" valign="bottom"><b>__do_sblnk_recurse_foreach</b> (<a class="el" href="struct____sblnk__node.html">sblnk_iter</a> cur, void(*fn)(void *), size_t offset)</td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ga4ae8c069e944daa94c9af719a6e8baea"></a><!-- doxytag: member="大小平衡树::__do_sblnk_recurse_reverse_foreach" ref="ga4ae8c069e944daa94c9af719a6e8baea" args="(sblnk_iter cur, void(*fn)(void *), size_t offset)" -->
NV_API void&#160;</td><td class="memItemRight" valign="bottom"><b>__do_sblnk_recurse_reverse_foreach</b> (<a class="el" href="struct____sblnk__node.html">sblnk_iter</a> cur, void(*fn)(void *), size_t offset)</td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ga0d7a7603fed32b3885b3d0c325c72cdc"></a><!-- doxytag: member="大小平衡树::__sblnk_recurse_foreach" ref="ga0d7a7603fed32b3885b3d0c325c72cdc" args="(sblnk_root *root, void(*fn)(void *), size_t offset)" -->
static void&#160;</td><td class="memItemRight" valign="bottom"><b>__sblnk_recurse_foreach</b> (<a class="el" href="structsblnk__root.html">sblnk_root</a> *root, void(*fn)(void *), size_t offset)</td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="gad146d7199a2dab2cbaf0afa77ff3d840"></a><!-- doxytag: member="大小平衡树::__sblnk_recurse_reverse_foreach" ref="gad146d7199a2dab2cbaf0afa77ff3d840" args="(sblnk_root *root, void(*fn)(void *), size_t offset)" -->
static void&#160;</td><td class="memItemRight" valign="bottom"><b>__sblnk_recurse_reverse_foreach</b> (<a class="el" href="structsblnk__root.html">sblnk_root</a> *root, void(*fn)(void *), size_t offset)</td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ga648a26023321b0e3362f1371f3c9550e"></a><!-- doxytag: member="大小平衡树::__sblnk_serialize" ref="ga648a26023321b0e3362f1371f3c9550e" args="(sblnk_root *root, void **buf, size_t offset)" -->
NV_API void&#160;</td><td class="memItemRight" valign="bottom"><b>__sblnk_serialize</b> (<a class="el" href="structsblnk__root.html">sblnk_root</a> *root, void **buf, size_t offset)</td></tr>
<tr><td class="memItemLeft" align="right" valign="top"><a class="anchor" id="ga07fc6f35c06e0f89d9d8124040095740"></a><!-- doxytag: member="大小平衡树::__sblnk_deserialize" ref="ga07fc6f35c06e0f89d9d8124040095740" args="(sblnk_root *root, char **buf, size_t cnt, size_t offset)" -->
NV_API void&#160;</td><td class="memItemRight" valign="bottom"><b>__sblnk_deserialize</b> (<a class="el" href="structsblnk__root.html">sblnk_root</a> *root, char **buf, size_t cnt, size_t offset)</td></tr>
</table>
<hr/><h2>宏定义文档</h2>
<a class="anchor" id="ga77426ccc7b1fb7bb23e58872fba730c2"></a><!-- doxytag: member="sblnk.h::SBLNK_ROOT" ref="ga77426ccc7b1fb7bb23e58872fba730c2" args="(name)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">#define SBLNK_ROOT</td>
          <td>(</td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">name</td><td>)</td>
          <td>&#160;&#160;&#160;<a class="el" href="structsblnk__root.html">sblnk_root</a> name = {NULL}</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>定义一个名为name的树根，并对其初始化 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramname">name</td><td>树根名称 </td></tr>
  </table>
  </dd>
</dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00083">83</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga84848fd6b4aaa586f512407a61d41744"></a><!-- doxytag: member="sblnk.h::SBLNK_NODE" ref="ga84848fd6b4aaa586f512407a61d41744" args="(name)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">#define SBLNK_NODE</td>
          <td>(</td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">name</td><td>)</td>
          <td>&#160;&#160;&#160;<a class="el" href="struct____sblnk__node.html">sblnk_node</a> name = {NULL, NULL, NULL, 0}</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>定义一个名为name的节点，并对其初始化 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramname">name</td><td>节点名称 </td></tr>
  </table>
  </dd>
</dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00084">84</a>行定义。</p>

</div>
</div>
<a class="anchor" id="gad0c44e99f672d370c01aaac8c695c4de"></a><!-- doxytag: member="sblnk.h::SBLNK_INFO" ref="gad0c44e99f672d370c01aaac8c695c4de" args="(name)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">#define SBLNK_INFO</td>
          <td>(</td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">name</td><td>)</td>
          <td>&#160;&#160;&#160;<a class="el" href="structsblnk__info.html">sblnk_info</a> name = {0, 0, 0}</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>定义一个名为name的树信息表，并对其初始化 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramname">name</td><td>名称 </td></tr>
  </table>
  </dd>
</dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00085">85</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga1d98dcdb6f4a7ed1ef8de3cf977c640f"></a><!-- doxytag: member="sblnk.h::sblnk_foreach" ref="ga1d98dcdb6f4a7ed1ef8de3cf977c640f" args="(_begin, _end, fn, type, member)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">#define sblnk_foreach</td>
          <td>(</td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">_begin, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">_end, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">fn, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">type, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">member&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div>
<div class="memdoc">
<b>值:</b><div class="fragment"><pre class="fragment"><span class="keywordflow">do</span> {\
        <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> _q_e = (_end);                           \
        <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> _q_f = (_begin);                         \
        <span class="keywordflow">while</span> (_q_f != _q_e) {                              \
            type * _q_t = container_of(_q_f, type, member); \
            <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga8977419721a1b85610adb2634f136983" title="迭代器递增">sblnk_inc</a>(_q_f);                                \
            fn(_q_t);                                       \
        }                                                   \
    } <span class="keywordflow">while</span> (0)
</pre></div>
<p>正向遍历_begin到_end的节点，并为每一个节点调用回调函数或宏 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">_begin</td><td>起始位置 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">_end</td><td>终止位置 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">fn</td><td>回调函数或宏 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">type</td><td>拥有者类型 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">member</td><td>所在成员名 </td></tr>
  </table>
  </dd>
</dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00721">721</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga65b3b2936facf1872cb83f0f13734740"></a><!-- doxytag: member="sblnk.h::sblnk_reverse_foreach" ref="ga65b3b2936facf1872cb83f0f13734740" args="(_rbegin, _rend, fn, type, member)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">#define sblnk_reverse_foreach</td>
          <td>(</td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">_rbegin, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">_rend, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">fn, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">type, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">member&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div>
<div class="memdoc">
<b>值:</b><div class="fragment"><pre class="fragment"><span class="keywordflow">do</span> {\
        <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> _q_e = (_rend);                          \
        <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> _q_f = (_rbegin);                        \
        <span class="keywordflow">while</span> (_q_f != _q_e) {                              \
            type * _q_t = container_of(_q_f, type, member); \
            <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga39f8da7ba1e44269c6ec1e7fb0125165" title="迭代器递减">sblnk_dec</a>(_q_f);                                \
            fn(_q_t);                                       \
        }                                                   \
    } <span class="keywordflow">while</span> (0)
</pre></div>
<p>逆向遍历_begin到_end的节点，并为每一个节点调用回调函数或宏 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">_rbegin</td><td>逆向起始位置 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">_rend</td><td>逆向终止位置 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">fn</td><td>回调函数或宏 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">type</td><td>拥有者类型 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">member</td><td>所在成员名 </td></tr>
  </table>
  </dd>
</dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00740">740</a>行定义。</p>

</div>
</div>
<a class="anchor" id="gaa132699dadc3b4d6cf77a99778d502f8"></a><!-- doxytag: member="sblnk.h::SBLNK_RECURSE_PROC" ref="gaa132699dadc3b4d6cf77a99778d502f8" args="(name, type, param)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">#define SBLNK_RECURSE_PROC</td>
          <td>(</td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">name, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">type, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">param&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td>&#160;&#160;&#160;void name(type * param)</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>定义递归遍历回调函数 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramname">name</td><td>函数名 </td></tr>
    <tr><td class="paramname">type</td><td>节点拥有者类型 </td></tr>
    <tr><td class="paramname">param</td><td>参数名 </td></tr>
  </table>
  </dd>
</dl>
<dl class="see"><dt><b>参见:</b></dt><dd><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gac178eb532821851b0ccf99e70f89b857" title="正向递归遍历整个树">sblnk_recurse_foreach</a>, <a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga0fe27927107ab630345681e6d37096c5" title="逆向递归遍历整个树">sblnk_recurse_reverse_foreach</a> </dd></dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00778">778</a>行定义。</p>

</div>
</div>
<a class="anchor" id="gac178eb532821851b0ccf99e70f89b857"></a><!-- doxytag: member="sblnk.h::sblnk_recurse_foreach" ref="gac178eb532821851b0ccf99e70f89b857" args="(root, fn, type, member)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">#define sblnk_recurse_foreach</td>
          <td>(</td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">root, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">fn, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">type, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">member&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div>
<div class="memdoc">
<b>值:</b><div class="fragment"><pre class="fragment">__sblnk_recurse_foreach(root, (<span class="keywordtype">void</span> (*)(<span class="keywordtype">void</span>*))(fn), \
            offset_of(type, member))
</pre></div>
<p>正向递归遍历整个树 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">root</td><td>树根 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">fn</td><td>回调函数或宏 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">type</td><td>拥有者类型 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">member</td><td>所在成员名 </td></tr>
  </table>
  </dd>
</dl>
<dl class="user"><dt><b>示例:</b></dt><dd><div class="fragment"><pre class="fragment">    <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaa132699dadc3b4d6cf77a99778d502f8" title="定义递归遍历回调函数">SBLNK_RECURSE_PROC</a>(PrintNode, DATA, node)
    {
        printf(<span class="stringliteral">&quot;%3d &quot;</span>, node-&gt;data);
    }

    <span class="comment">// 打印整个树</span>
    <span class="keywordtype">void</span> PrintAVLTree(<a class="code" href="structsblnk__root.html" title="树根">sblnk_root</a>* root)
    {
        <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gac178eb532821851b0ccf99e70f89b857" title="正向递归遍历整个树">sblnk_recurse_foreach</a>(root, PrintNode, DATA, node);
        putchar(<span class="charliteral">&#39;\n&#39;</span>);
    }
</pre></div> </dd></dl>
<dl class="see"><dt><b>参见:</b></dt><dd><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga0fe27927107ab630345681e6d37096c5" title="逆向递归遍历整个树">sblnk_recurse_reverse_foreach</a>, <a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaa132699dadc3b4d6cf77a99778d502f8" title="定义递归遍历回调函数">SBLNK_RECURSE_PROC</a> </dd></dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00803">803</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga0fe27927107ab630345681e6d37096c5"></a><!-- doxytag: member="sblnk.h::sblnk_recurse_reverse_foreach" ref="ga0fe27927107ab630345681e6d37096c5" args="(root, fn, type, member)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">#define sblnk_recurse_reverse_foreach</td>
          <td>(</td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">root, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">fn, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">type, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">member&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div>
<div class="memdoc">
<b>值:</b><div class="fragment"><pre class="fragment">__sblnk_recurse_reverse_foreach(root, (<span class="keywordtype">void</span> (*)(<span class="keywordtype">void</span>*))(fn), \
            offset_of(type, member))
</pre></div>
<p>逆向递归遍历整个树 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">root</td><td>树根 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">fn</td><td>回调函数或宏 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">type</td><td>拥有者类型 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">member</td><td>所在成员名 </td></tr>
  </table>
  </dd>
</dl>
<dl class="see"><dt><b>参见:</b></dt><dd><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gac178eb532821851b0ccf99e70f89b857" title="正向递归遍历整个树">sblnk_recurse_foreach</a>, <a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaa132699dadc3b4d6cf77a99778d502f8" title="定义递归遍历回调函数">SBLNK_RECURSE_PROC</a> </dd></dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00816">816</a>行定义。</p>

</div>
</div>
<a class="anchor" id="gac3f9e0c692066835cd57f562954e3d54"></a><!-- doxytag: member="sblnk.h::sblnk_search" ref="gac3f9e0c692066835cd57f562954e3d54" args="(root, newly, greater, res, type, member)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">#define sblnk_search</td>
          <td>(</td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">root, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">newly, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">greater, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">res, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">type, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">member&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div>
<div class="memdoc">
<b>值:</b><div class="fragment"><pre class="fragment"><span class="keywordflow">do</span> {\
        <a class="code" href="structsblnk__root.html" title="树根">sblnk_root</a>* _k_r = (root);                              \
        type * _k_pn = (newly);                                 \
        <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> _k_p = _k_r-&gt;<a class="code" href="structsblnk__root.html#a5b775a8ecc9de098808ca8c7f1e365c4" title="树根节点">node</a>;                           \
        (res) = NULL;                                           \
        <span class="keywordflow">while</span> (_k_p) {                                          \
            type * _k_pr = container_of(_k_p, type, member);    \
            <span class="keywordflow">if</span> (greater(_k_pr, _k_pn))                          \
                _k_p = _k_p-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>;                              \
            <span class="keywordflow">else</span> <span class="keywordflow">if</span> (greater(_k_pn, _k_pr))                     \
                _k_p = _k_p-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>;                             \
            <span class="keywordflow">else</span> {                                              \
                (res) = _k_p; <span class="keywordflow">break</span>;                            \
            }                                                   \
        }                                                       \
    } <span class="keywordflow">while</span> (0)
</pre></div>
<p>搜索树中的某个节点 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">root</td><td>树根 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">newly</td><td>用于搜索的临时节点，类型是type，该节点使用与搜索的值相同的值 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">greater</td><td>比较函数或宏。 升序:(i-&gt;data &gt; j-&gt;data) 降序:(i-&gt;data &lt; j-&gt;data) </td></tr>
    <tr><td class="paramdir">[out]</td><td class="paramname">res</td><td>返回值。返回目标节点，若为NULL表示找不到节点 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">type</td><td>拥有者类型 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">member</td><td>所在成员名 </td></tr>
  </table>
  </dd>
</dl>
<dl class="user"><dt><b>示例:</b></dt><dd><div class="fragment"><pre class="fragment">    <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> node_15;
    DATA* p = (DATA*)malloc(<span class="keyword">sizeof</span>(DATA));
    <span class="keywordflow">if</span> (!p)
        <span class="keywordflow">return</span> NULL;

    p-&gt;data = 15;

    <span class="comment">//查找值为15的节点</span>
    <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gac3f9e0c692066835cd57f562954e3d54" title="搜索树中的某个节点">sblnk_search</a>(&amp;root, p, DATA_Greater, node_15, DATA, node);
    <span class="keywordflow">if</span> (!node_15)
        <span class="keywordflow">return</span> NULL;

    <span class="keywordflow">return</span> node_15;
</pre></div> </dd></dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00848">848</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga9610155afa17d2c85e71f9548e255f6c"></a><!-- doxytag: member="sblnk.h::sblnk_insert" ref="ga9610155afa17d2c85e71f9548e255f6c" args="(root, newly, greater, res, type, member)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">#define sblnk_insert</td>
          <td>(</td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">root, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">newly, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">greater, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">res, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">type, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">member&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div>
<div class="memdoc">
<b>值:</b><div class="fragment"><pre class="fragment"><span class="keywordflow">do</span> {\
        <a class="code" href="structsblnk__root.html" title="树根">sblnk_root</a>* _k_r = (root);                                      \
        <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a>* _k_pp = &amp;_k_r-&gt;<a class="code" href="structsblnk__root.html#a5b775a8ecc9de098808ca8c7f1e365c4" title="树根节点">node</a>;                                \
        <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> _k_n = (newly);                                      \
        <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> _k_p;                                                \
        type * _k_pn = container_of(_k_n, type, member);                \
        (res) = 1;                                                      \
        <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gab1ec464fdb4d8c762425fc30448423f4" title="初始化节点">sblnk_node_init</a>(_k_n);                                          \
        <span class="keywordflow">while</span> (*_k_pp) {                                                \
            type * _k_pr = container_of(_k_p = *_k_pp, type, member);   \
            <span class="keywordflow">if</span> (greater(_k_pr, _k_pn))                                  \
                _k_pp = &amp;_k_p-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>;                                    \
            <span class="keywordflow">else</span> <span class="keywordflow">if</span> (greater(_k_pn, _k_pr))                             \
                _k_pp = &amp;_k_p-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>;                                   \
            <span class="keywordflow">else</span> {                                                      \
                (res) = 0; <span class="keywordflow">break</span>;                                       \
            }                                                           \
        }                                                               \
        <span class="keywordflow">if</span> (res) {                                                      \
            <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaf89a0ca64b9f9d4c9ce25487e19f1267" title="链接两个节点">sblnk_link</a>(_k_n, _k_p, _k_pp);                              \
            <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga19c2e9e6ec1788d13f34c1f230b47d02" title="插入节点后，对树进行调整">sblnk_maintain</a>(_k_r, _k_n, _k_p);                           \
        }                                                               \
    } <span class="keywordflow">while</span> (0)
</pre></div>
<p>插入新节点 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">root</td><td>树根 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">newly</td><td>新节点 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">greater</td><td>比较函数或宏。 升序:(i-&gt;data &gt; j-&gt;data) 降序:(i-&gt;data &lt; j-&gt;data) </td></tr>
    <tr><td class="paramdir">[out]</td><td class="paramname">res</td><td>返回值。返回1表示成功；若为0表示节点有冲突，无法插入 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">type</td><td>拥有者类型 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">member</td><td>所在成员名 </td></tr>
  </table>
  </dd>
</dl>
<dl class="user"><dt><b>示例:</b></dt><dd><div class="fragment"><pre class="fragment">    <span class="keywordtype">int</span> ret;
    DATA* p = (DATA*)malloc(<span class="keyword">sizeof</span>(DATA));
    <span class="keywordflow">if</span> (!p)
        <span class="keywordflow">return</span> 0;

    p-&gt;data = 88;

    <span class="comment">//插入值为88的节点</span>
    <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga9610155afa17d2c85e71f9548e255f6c" title="插入新节点">sblnk_insert</a>(&amp;root, &amp;p-&gt;node, DATA_Greater, ret, DATA, node);
    <span class="keywordflow">if</span> (!ret)
        <span class="keywordflow">return</span> 0;

    <span class="keywordflow">return</span> 1;
</pre></div> </dd></dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00893">893</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga87d6d30a36e8688e2bbcc5c349dc4bd5"></a><!-- doxytag: member="sblnk.h::sblnk_serialize" ref="ga87d6d30a36e8688e2bbcc5c349dc4bd5" args="(root, buf, type, member)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">#define sblnk_serialize</td>
          <td>(</td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">root, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">buf, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">type, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">member&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td>&#160;&#160;&#160;__sblnk_serialize(root, (void**)(buf), offset_of(type, member))</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>将树进行序列化为一个有序序列 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">root</td><td>树根 </td></tr>
    <tr><td class="paramdir">[out]</td><td class="paramname">buf</td><td>序列缓存，元素类型为type指针类型 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">type</td><td>拥有者类型 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">member</td><td>所在成员名 </td></tr>
  </table>
  </dd>
</dl>
<dl class="see"><dt><b>参见:</b></dt><dd><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga4bae9dc037366733482ee79511cbc2c4" title="根据树的序列进行反序列化为一个完整的树">sblnk_deserialize</a>, <a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga9ade2ee98cf812276ab751ead800e5bc" title="判断树是否可以序列化">sblnk_serialable</a> </dd></dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00931">931</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga4bae9dc037366733482ee79511cbc2c4"></a><!-- doxytag: member="sblnk.h::sblnk_deserialize" ref="ga4bae9dc037366733482ee79511cbc2c4" args="(root, buf, cnt, type, member)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">#define sblnk_deserialize</td>
          <td>(</td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">root, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">buf, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">cnt, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">type, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">&#160;</td>
          <td class="paramname">member&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td>&#160;&#160;&#160;__sblnk_deserialize(root, (char**)(buf), cnt, offset_of(type, member))</td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>根据树的序列进行反序列化为一个完整的树 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[out]</td><td class="paramname">root</td><td>树根 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">buf</td><td>序列缓存，元素类型为type指针类型 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">cnt</td><td>序列长度(元素数) </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">type</td><td>拥有者类型 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">member</td><td>所在成员名 </td></tr>
  </table>
  </dd>
</dl>
<dl class="see"><dt><b>参见:</b></dt><dd><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga87d6d30a36e8688e2bbcc5c349dc4bd5" title="将树进行序列化为一个有序序列">sblnk_serialize</a>, <a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga9ade2ee98cf812276ab751ead800e5bc" title="判断树是否可以序列化">sblnk_serialable</a> </dd></dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00944">944</a>行定义。</p>

</div>
</div>
<hr/><h2>函数文档</h2>
<a class="anchor" id="gad792d3ec9e12043ac935238471075fd5"></a><!-- doxytag: member="sblnk.h::sblnk_distance" ref="gad792d3ec9e12043ac935238471075fd5" args="(sblnk_iter first, sblnk_iter last)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">NV_API size_t sblnk_distance </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td>
          <td class="paramname"><em>first</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td>
          <td class="paramname"><em>last</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>计算两个节点的迭代距离 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">first</td><td>首节点 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">last</td><td>尾节点 </td></tr>
  </table>
  </dd>
</dl>
<dl class="note"><dt><b>注解:</b></dt><dd>以索引为例，2到4的距离是4 (4-2+1=3) </dd></dl>
<dl class="return"><dt><b>返回:</b></dt><dd>size_t 返回距离 </dd></dl>

<p>在文件<a class="el" href="sblnk_8c_source.html">sblnk.c</a>第<a class="el" href="sblnk_8c_source.html#l00599">599</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga85091b37cced90e27aace1ed466f15b9"></a><!-- doxytag: member="sblnk.h::sblnk_index_of" ref="ga85091b37cced90e27aace1ed466f15b9" args="(sblnk_root *root, sblnk_iter itr)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">NV_API size_t sblnk_index_of </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structsblnk__root.html">sblnk_root</a> *&#160;</td>
          <td class="paramname"><em>root</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td>
          <td class="paramname"><em>itr</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>计算迭代器的正向索引 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">root</td><td>树根 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">itr</td><td>迭代器 </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>返回:</b></dt><dd>size_t 返回索引 </dd></dl>
<dl class="see"><dt><b>参见:</b></dt><dd><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gabe9efb0165493808f4e6896a70eda6de" title="计算迭代器的逆向索引">sblnk_reverse_index_of</a> </dd></dl>

<p>在文件<a class="el" href="sblnk_8c_source.html">sblnk.c</a>第<a class="el" href="sblnk_8c_source.html#l00611">611</a>行定义。</p>

</div>
</div>
<a class="anchor" id="gabe9efb0165493808f4e6896a70eda6de"></a><!-- doxytag: member="sblnk.h::sblnk_reverse_index_of" ref="gabe9efb0165493808f4e6896a70eda6de" args="(sblnk_root *root, sblnk_iter itr)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">NV_API size_t sblnk_reverse_index_of </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structsblnk__root.html">sblnk_root</a> *&#160;</td>
          <td class="paramname"><em>root</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td>
          <td class="paramname"><em>itr</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>计算迭代器的逆向索引 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">root</td><td>树根 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">itr</td><td>迭代器 </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>返回:</b></dt><dd>size_t 返回索引 </dd></dl>
<dl class="see"><dt><b>参见:</b></dt><dd><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga85091b37cced90e27aace1ed466f15b9" title="计算迭代器的正向索引">sblnk_index_of</a> </dd></dl>

<p>在文件<a class="el" href="sblnk_8c_source.html">sblnk.c</a>第<a class="el" href="sblnk_8c_source.html#l00624">624</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga0d2affd3956b699ba994f82a13b3cf2b"></a><!-- doxytag: member="sblnk.h::sblnk_depth" ref="ga0d2affd3956b699ba994f82a13b3cf2b" args="(sblnk_root *root)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">NV_API size_t sblnk_depth </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structsblnk__root.html">sblnk_root</a> *&#160;</td>
          <td class="paramname"><em>root</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>计算树的深度 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">root</td><td>树根 </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>返回:</b></dt><dd>size_t 返回深度 </dd></dl>
<dl class="see"><dt><b>参见:</b></dt><dd><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaf5442bb764fe7fd9ff8d796dff0551e0" title="获取树的信息，包括节点数、深度、叶子数">sblnk_get_info</a> </dd></dl>

<p>在文件<a class="el" href="sblnk_8c_source.html">sblnk.c</a>第<a class="el" href="sblnk_8c_source.html#l00482">482</a>行定义。</p>

</div>
</div>
<a class="anchor" id="gab7ece6c8087440945d0a50d8cd81b423"></a><!-- doxytag: member="sblnk.h::sblnk_leafs" ref="gab7ece6c8087440945d0a50d8cd81b423" args="(sblnk_root *root)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">NV_API size_t sblnk_leafs </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structsblnk__root.html">sblnk_root</a> *&#160;</td>
          <td class="paramname"><em>root</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>计算树的叶子数 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">root</td><td>树根 </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>返回:</b></dt><dd>size_t 返回叶子数 </dd></dl>
<dl class="see"><dt><b>参见:</b></dt><dd><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaf5442bb764fe7fd9ff8d796dff0551e0" title="获取树的信息，包括节点数、深度、叶子数">sblnk_get_info</a> </dd></dl>

<p>在文件<a class="el" href="sblnk_8c_source.html">sblnk.c</a>第<a class="el" href="sblnk_8c_source.html#l00523">523</a>行定义。</p>

</div>
</div>
<a class="anchor" id="gaf5442bb764fe7fd9ff8d796dff0551e0"></a><!-- doxytag: member="sblnk.h::sblnk_get_info" ref="gaf5442bb764fe7fd9ff8d796dff0551e0" args="(sblnk_root *root, sblnk_info *info)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">NV_API void sblnk_get_info </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structsblnk__root.html">sblnk_root</a> *&#160;</td>
          <td class="paramname"><em>root</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="structsblnk__info.html">sblnk_info</a> *&#160;</td>
          <td class="paramname"><em>info</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>获取树的信息，包括节点数、深度、叶子数 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">root</td><td>树根 </td></tr>
    <tr><td class="paramdir">[out]</td><td class="paramname">info</td><td>保存信息的结构体 </td></tr>
  </table>
  </dd>
</dl>
<dl class="see"><dt><b>参见:</b></dt><dd><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga70443373b0ae8f6e9c8dbd01ab276d8b" title="获取树的节点总数">sblnk_count</a>, <a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga0d2affd3956b699ba994f82a13b3cf2b" title="计算树的深度">sblnk_depth</a>, <a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gab7ece6c8087440945d0a50d8cd81b423" title="计算树的叶子数">sblnk_leafs</a> </dd></dl>

<p>在文件<a class="el" href="sblnk_8c_source.html">sblnk.c</a>第<a class="el" href="sblnk_8c_source.html#l00550">550</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga19c2e9e6ec1788d13f34c1f230b47d02"></a><!-- doxytag: member="sblnk.h::sblnk_maintain" ref="ga19c2e9e6ec1788d13f34c1f230b47d02" args="(sblnk_root *root, sblnk_node *node, sblnk_node *parent)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">NV_API void sblnk_maintain </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structsblnk__root.html">sblnk_root</a> *&#160;</td>
          <td class="paramname"><em>root</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_node</a> *&#160;</td>
          <td class="paramname"><em>node</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_node</a> *&#160;</td>
          <td class="paramname"><em>parent</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>插入节点后，对树进行调整 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in,out]</td><td class="paramname">root</td><td>树根 </td></tr>
    <tr><td class="paramdir">[in,out]</td><td class="paramname">node</td><td>目标节点 </td></tr>
    <tr><td class="paramdir">[in,out]</td><td class="paramname">parent</td><td>node的父节点 </td></tr>
  </table>
  </dd>
</dl>
<dl class="note"><dt><b>注解:</b></dt><dd>常用于节点插入，在sblnk_link之后调用 </dd></dl>
<dl class="user"><dt><b>示例:</b></dt><dd><div class="fragment"><pre class="fragment">    <span class="keywordtype">int</span> insert_node(<a class="code" href="structsblnk__root.html" title="树根">sblnk_root</a>* root, DATA* newly)
    {
        DATA* pdat;
        <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a> cur;
        <a class="code" href="struct____sblnk__node.html" title="大小平衡树节点">sblnk_iter</a>* p = &amp;root-&gt;<a class="code" href="structsblnk__root.html#a5b775a8ecc9de098808ca8c7f1e365c4" title="树根节点">node</a>;
        
        <span class="comment">// 初始化新节点</span>
        <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gab1ec464fdb4d8c762425fc30448423f4" title="初始化节点">sblnk_node_init</a>(&amp;newly-&gt;node);
        
        <span class="keywordflow">while</span> (*p) {
            cur = *p;
            pdat = container_of(cur, DATA, node);
            <span class="keywordflow">if</span> (pdat-&gt;data &gt; newly-&gt;data)
                p = &amp;cur-&gt;<a class="code" href="struct____sblnk__node.html#a319a145de7e3c1952d51528efc35b0d7" title="左子节点">left</a>;
            <span class="keywordflow">else</span> <span class="keywordflow">if</span> (pdat-&gt;data &lt; newly-&gt;data)
                p = &amp;cur-&gt;<a class="code" href="struct____sblnk__node.html#a1f41e1366c9345596b528fc6aee3187d" title="右子节点">right</a>;
            <span class="keywordflow">else</span> {
                <span class="comment">// 有相同值的节点，无法插入</span>
                <span class="keywordflow">return</span> 0;
            }
        }
        
        <span class="comment">// 链接新节点到树中</span>
        <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaf89a0ca64b9f9d4c9ce25487e19f1267" title="链接两个节点">sblnk_link</a>(&amp;newly-&gt;node, cur, p);
        
        <span class="comment">// 调整树</span>
        <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga19c2e9e6ec1788d13f34c1f230b47d02" title="插入节点后，对树进行调整">sblnk_maintain</a>(root, &amp;newly-&gt;<a class="code" href="structsblnk__root.html#a5b775a8ecc9de098808ca8c7f1e365c4" title="树根节点">node</a>, cur);

        <span class="keywordflow">return</span> 1;
    }
</pre></div> </dd></dl>
<dl class="see"><dt><b>参见:</b></dt><dd><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga9610155afa17d2c85e71f9548e255f6c" title="插入新节点">sblnk_insert</a>, <a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaf89a0ca64b9f9d4c9ce25487e19f1267" title="链接两个节点">sblnk_link</a> </dd></dl>

<p>在文件<a class="el" href="sblnk_8c_source.html">sblnk.c</a>第<a class="el" href="sblnk_8c_source.html#l00103">103</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga87e9e7a65a0850fb3b02455a2a9e54d2"></a><!-- doxytag: member="sblnk.h::sblnk_erase" ref="ga87e9e7a65a0850fb3b02455a2a9e54d2" args="(sblnk_root *root, sblnk_node *entry)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">NV_API void sblnk_erase </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structsblnk__root.html">sblnk_root</a> *&#160;</td>
          <td class="paramname"><em>root</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_node</a> *&#160;</td>
          <td class="paramname"><em>entry</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>移除某个节点 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in,out]</td><td class="paramname">root</td><td>树根 </td></tr>
    <tr><td class="paramdir">[in,out]</td><td class="paramname">entry</td><td>待移除节点 </td></tr>
  </table>
  </dd>
</dl>

<p>在文件<a class="el" href="sblnk_8c_source.html">sblnk.c</a>第<a class="el" href="sblnk_8c_source.html#l00314">314</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga9028bdd9eb8000ed59e1a512af48a37a"></a><!-- doxytag: member="sblnk.h::sblnk_erases" ref="ga9028bdd9eb8000ed59e1a512af48a37a" args="(sblnk_root *root, sblnk_iter begin, sblnk_iter end, sblnk_pr1 erase_handler)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">NV_API void sblnk_erases </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structsblnk__root.html">sblnk_root</a> *&#160;</td>
          <td class="paramname"><em>root</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td>
          <td class="paramname"><em>begin</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td>
          <td class="paramname"><em>end</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga4af164439491a4ca79da044842819995">sblnk_pr1</a>&#160;</td>
          <td class="paramname"><em>erase_handler</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>移除区域内的节点 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in,out]</td><td class="paramname">root</td><td>树根</td></tr>
    <tr><td class="paramdir">[in,out]</td><td class="paramname">begin</td><td>起始位置 </td></tr>
    <tr><td class="paramdir">[in,out]</td><td class="paramname">end</td><td>终止位置 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">erase_handler</td><td>移除响应函数，通常用于监视和释放节点，可以传递NULL, 表示不为删除的节点调用响应来处理 </td></tr>
  </table>
  </dd>
</dl>
<dl class="note"><dt><b>注解:</b></dt><dd>函数会为每一个被移除的节点调用erase_handler来处理节点 </dd></dl>
<dl class="see"><dt><b>参见:</b></dt><dd><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga0c4657b6e570cc5db49102522b162a80" title="清空树">sblnk_clear</a> </dd></dl>

<p>在文件<a class="el" href="sblnk_8c_source.html">sblnk.c</a>第<a class="el" href="sblnk_8c_source.html#l00372">372</a>行定义。</p>

</div>
</div>
<a class="anchor" id="gad68cb541128675d3c8a165e6d0d4d229"></a><!-- doxytag: member="sblnk.h::sblnk_init" ref="gad68cb541128675d3c8a165e6d0d4d229" args="(sblnk_root *root)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">static inline void sblnk_init </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structsblnk__root.html">sblnk_root</a> *&#160;</td>
          <td class="paramname"><em>root</em></td><td>)</td>
          <td><code> [inline, static]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>初始化树根 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[out]</td><td class="paramname">root</td><td>目标树根 </td></tr>
  </table>
  </dd>
</dl>
<dl class="user"><dt><b>示例:</b></dt><dd><div class="fragment"><pre class="fragment">    <a class="code" href="structsblnk__root.html" title="树根">sblnk_root</a> r;
    <span class="comment">// 初始化</span>
    <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gad68cb541128675d3c8a165e6d0d4d229" title="初始化树根">sblnk_init</a>(&amp;r);
</pre></div> </dd></dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00234">234</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga8b2053d41e14a1f256bbf06168ec97fe"></a><!-- doxytag: member="sblnk.h::sblnk_empty" ref="ga8b2053d41e14a1f256bbf06168ec97fe" args="(sblnk_root *root)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">static inline int sblnk_empty </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structsblnk__root.html">sblnk_root</a> *&#160;</td>
          <td class="paramname"><em>root</em></td><td>)</td>
          <td><code> [inline, static]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>判断树是否为空 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">root</td><td>树根 </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>返回:</b></dt><dd>int 返回结果 </dd></dl>
<dl><dt><b>返回值:</b></dt><dd>
  <table class="retval">
    <tr><td class="paramname">1</td><td>真 </td></tr>
    <tr><td class="paramname">0</td><td>假 </td></tr>
  </table>
  </dd>
</dl>
<dl class="user"><dt><b>示例:</b></dt><dd><div class="fragment"><pre class="fragment">    <span class="keywordflow">if</span> (!<a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga8b2053d41e14a1f256bbf06168ec97fe" title="判断树是否为空">sblnk_empty</a>(&amp;r)) {
        ......
    }
</pre></div> </dd></dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00253">253</a>行定义。</p>

</div>
</div>
<a class="anchor" id="gabbfd4bc4031072dd875a16e2eef0e18c"></a><!-- doxytag: member="sblnk.h::sblnk_singular" ref="gabbfd4bc4031072dd875a16e2eef0e18c" args="(sblnk_root *root)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">static inline int sblnk_singular </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structsblnk__root.html">sblnk_root</a> *&#160;</td>
          <td class="paramname"><em>root</em></td><td>)</td>
          <td><code> [inline, static]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>判断树是否只有单个节点 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">root</td><td>树根 </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>返回:</b></dt><dd>int 返回结果 </dd></dl>
<dl><dt><b>返回值:</b></dt><dd>
  <table class="retval">
    <tr><td class="paramname">1</td><td>真 </td></tr>
    <tr><td class="paramname">0</td><td>假 </td></tr>
  </table>
  </dd>
</dl>
<dl class="user"><dt><b>示例:</b></dt><dd><div class="fragment"><pre class="fragment">    <span class="keywordflow">if</span> (<a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gabbfd4bc4031072dd875a16e2eef0e18c" title="判断树是否只有单个节点">sblnk_singular</a>(&amp;r)) {
        ......
    }
</pre></div> </dd></dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00277">277</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga9ade2ee98cf812276ab751ead800e5bc"></a><!-- doxytag: member="sblnk.h::sblnk_serialable" ref="ga9ade2ee98cf812276ab751ead800e5bc" args="(sblnk_root *root)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">static inline int sblnk_serialable </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structsblnk__root.html">sblnk_root</a> *&#160;</td>
          <td class="paramname"><em>root</em></td><td>)</td>
          <td><code> [inline, static]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>判断树是否可以序列化 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">root</td><td>树根 </td></tr>
  </table>
  </dd>
</dl>
<dl class="note"><dt><b>注解:</b></dt><dd>即判断是否至少有一个节点 </dd></dl>
<dl class="return"><dt><b>返回:</b></dt><dd>int 返回结果 </dd></dl>
<dl><dt><b>返回值:</b></dt><dd>
  <table class="retval">
    <tr><td class="paramname">1</td><td>真 </td></tr>
    <tr><td class="paramname">0</td><td>假 </td></tr>
  </table>
  </dd>
</dl>
<dl class="user"><dt><b>示例:</b></dt><dd><div class="fragment"><pre class="fragment">    <span class="comment">// 判断是否可以序列化</span>
    <span class="keywordflow">if</span> (<a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga9ade2ee98cf812276ab751ead800e5bc" title="判断树是否可以序列化">sblnk_serialable</a>(&amp;r)) {
        <a class="code" href="group___xE5_x8D_x95_xE7_xAB_xAF_xE7_xBA_xBF_xE5_xBD_xA2_xE5_xBA_x8F_xE8_xA1_xA8.html#gab7b8f6f20db0f3e5681fd2184b1ae60c" title="type类型表头">slseq_head</a> seq;
        <span class="comment">// 分配序列缓存</span>
        DATA** buf = (DATA**)malloc(<span class="keyword">sizeof</span>(DATA*) * avl_cnt);
        <span class="comment">// 序列化</span>
        <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga87d6d30a36e8688e2bbcc5c349dc4bd5" title="将树进行序列化为一个有序序列">sblnk_serialize</a>(&amp;r, buf, DATA, node);
        <a class="code" href="group___xE5_x8D_x95_xE7_xAB_xAF_xE7_xBA_xBF_xE5_xBD_xA2_xE5_xBA_x8F_xE8_xA1_xA8.html#ga08213d0c7bcf381b466b18e3822c6934" title="初始化序列">SLSEQ_INIT_SERIAL</a>(&amp;seq, buf, avl_cnt);
        ......
        <span class="comment">// do something</span>
        ......
        <span class="comment">// 反序列化</span>
        <a class="code" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga4bae9dc037366733482ee79511cbc2c4" title="根据树的序列进行反序列化为一个完整的树">sblnk_deserialize</a>(&amp;r, buf, avl_cnt, DATA, node);
        <span class="comment">// 释放缓存</span>
        free(buf);
    }
</pre></div> </dd></dl>
<dl class="see"><dt><b>参见:</b></dt><dd><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga87d6d30a36e8688e2bbcc5c349dc4bd5" title="将树进行序列化为一个有序序列">sblnk_serialize</a>, <a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga4bae9dc037366733482ee79511cbc2c4" title="根据树的序列进行反序列化为一个完整的树">sblnk_deserialize</a> </dd></dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00311">311</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga70443373b0ae8f6e9c8dbd01ab276d8b"></a><!-- doxytag: member="sblnk.h::sblnk_count" ref="ga70443373b0ae8f6e9c8dbd01ab276d8b" args="(sblnk_root *root)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">size_t sblnk_count </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structsblnk__root.html">sblnk_root</a> *&#160;</td>
          <td class="paramname"><em>root</em></td><td>)</td>
          <td><code> [inline, static]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>获取树的节点总数 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">root</td><td>树根 </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>返回:</b></dt><dd>size_t 返回节点数 </dd></dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00329">329</a>行定义。</p>

</div>
</div>
<a class="anchor" id="gab12dea4f3e2f3ab2709e8c458056f6b2"></a><!-- doxytag: member="sblnk.h::sblnk_left" ref="gab12dea4f3e2f3ab2709e8c458056f6b2" args="(sblnk_node *node)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">static inline <a class="el" href="struct____sblnk__node.html">sblnk_iter</a> sblnk_left </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_node</a> *&#160;</td>
          <td class="paramname"><em>node</em></td><td>)</td>
          <td><code> [inline, static]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>得到左子节点 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">node</td><td>当前节点 </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>返回:</b></dt><dd>sblnk_iter 返回左子节点 </dd></dl>
<dl class="see"><dt><b>参见:</b></dt><dd><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga2238721162bee093678cdd7aecb11990" title="得到右子节点">sblnk_right</a> </dd></dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00341">341</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga2238721162bee093678cdd7aecb11990"></a><!-- doxytag: member="sblnk.h::sblnk_right" ref="ga2238721162bee093678cdd7aecb11990" args="(sblnk_node *node)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">static inline <a class="el" href="struct____sblnk__node.html">sblnk_iter</a> sblnk_right </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_node</a> *&#160;</td>
          <td class="paramname"><em>node</em></td><td>)</td>
          <td><code> [inline, static]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>得到右子节点 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">node</td><td>当前节点 </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>返回:</b></dt><dd>sblnk_iter 返回右子节点 </dd></dl>
<dl class="see"><dt><b>参见:</b></dt><dd><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gab12dea4f3e2f3ab2709e8c458056f6b2" title="得到左子节点">sblnk_left</a> </dd></dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00353">353</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga2b84c86f24154173661a6b15a7f8392f"></a><!-- doxytag: member="sblnk.h::sblnk_parent" ref="ga2b84c86f24154173661a6b15a7f8392f" args="(sblnk_node *node)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">static inline <a class="el" href="struct____sblnk__node.html">sblnk_iter</a> sblnk_parent </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_node</a> *&#160;</td>
          <td class="paramname"><em>node</em></td><td>)</td>
          <td><code> [inline, static]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>得到父节点 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">node</td><td>当前节点 </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>返回:</b></dt><dd>sblnk_iter 返回父节点 </dd></dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00364">364</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga2c8271615d973239ac49bc721263ffd4"></a><!-- doxytag: member="sblnk.h::sblnk_size" ref="ga2c8271615d973239ac49bc721263ffd4" args="(sblnk_node *node)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">static inline size_t sblnk_size </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_node</a> *&#160;</td>
          <td class="paramname"><em>node</em></td><td>)</td>
          <td><code> [inline, static]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>得到节点的子树大小 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">node</td><td>当前节点 </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>返回:</b></dt><dd>size_t 返回子树大小 </dd></dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00375">375</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga80e18a0fd09125d1fd04c420848adee6"></a><!-- doxytag: member="sblnk.h::sblnk_is_root" ref="ga80e18a0fd09125d1fd04c420848adee6" args="(sblnk_iter itr)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">static inline int sblnk_is_root </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td>
          <td class="paramname"><em>itr</em></td><td>)</td>
          <td><code> [inline, static]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>判断当前节点是否是根节点 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">itr</td><td>当前节点 </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>返回:</b></dt><dd>int 返回结果 </dd></dl>
<dl><dt><b>返回值:</b></dt><dd>
  <table class="retval">
    <tr><td class="paramname">1</td><td>是根节点 </td></tr>
    <tr><td class="paramname">0</td><td>不是根节点 </td></tr>
  </table>
  </dd>
</dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00388">388</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga279e84ec3fd30ebd6ab8a2bec720c320"></a><!-- doxytag: member="sblnk.h::sblnk_is_leaf" ref="ga279e84ec3fd30ebd6ab8a2bec720c320" args="(sblnk_iter itr)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">static inline int sblnk_is_leaf </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td>
          <td class="paramname"><em>itr</em></td><td>)</td>
          <td><code> [inline, static]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>判断当前节点是否是叶子节点 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">itr</td><td>当前节点 </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>返回:</b></dt><dd>int 返回结果 </dd></dl>
<dl><dt><b>返回值:</b></dt><dd>
  <table class="retval">
    <tr><td class="paramname">1</td><td>是叶子节点 </td></tr>
    <tr><td class="paramname">0</td><td>不是叶子节点 </td></tr>
  </table>
  </dd>
</dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00401">401</a>行定义。</p>

</div>
</div>
<a class="anchor" id="gaf89a0ca64b9f9d4c9ce25487e19f1267"></a><!-- doxytag: member="sblnk.h::sblnk_link" ref="gaf89a0ca64b9f9d4c9ce25487e19f1267" args="(sblnk_iter newly, sblnk_iter parent, sblnk_iter *plink)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">static inline void sblnk_link </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td>
          <td class="paramname"><em>newly</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td>
          <td class="paramname"><em>parent</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_iter</a> *&#160;</td>
          <td class="paramname"><em>plink</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td><code> [inline, static]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>链接两个节点 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in,out]</td><td class="paramname">newly</td><td>新节点 </td></tr>
    <tr><td class="paramdir">[in,out]</td><td class="paramname">parent</td><td>父节点 </td></tr>
    <tr><td class="paramdir">[in,out]</td><td class="paramname">plink</td><td>父节点对应孩子指针。若newly加入parent的左子，则plink指向 parent的left成员，若newly加入parent的右子，则plink指向 parent的right成员 </td></tr>
  </table>
  </dd>
</dl>
<dl class="note"><dt><b>注解:</b></dt><dd>链接newly和parent节点 </dd></dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00417">417</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga8b3e8e509ef35403fb8f80a7e9bba5fd"></a><!-- doxytag: member="sblnk.h::sblnk_set_size" ref="ga8b3e8e509ef35403fb8f80a7e9bba5fd" args="(sblnk_node *node, size_t size)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">static inline void sblnk_set_size </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_node</a> *&#160;</td>
          <td class="paramname"><em>node</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">size_t&#160;</td>
          <td class="paramname"><em>size</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td><code> [inline, static]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>设置当前节点子树大小域 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in,out]</td><td class="paramname">node</td><td>当前节点 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">size</td><td>新子树大小 </td></tr>
  </table>
  </dd>
</dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00433">433</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga570d0615947869f006d217e1c5b68685"></a><!-- doxytag: member="sblnk.h::sblnk_set_parent_if" ref="ga570d0615947869f006d217e1c5b68685" args="(sblnk_node *node, sblnk_node *parent)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">static inline void sblnk_set_parent_if </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_node</a> *&#160;</td>
          <td class="paramname"><em>node</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_node</a> *&#160;</td>
          <td class="paramname"><em>parent</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td><code> [inline, static]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>仅在node不为空时，设置node的父节点 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in,out]</td><td class="paramname">node</td><td>当前节点 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">parent</td><td>新的父节点 </td></tr>
  </table>
  </dd>
</dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00445">445</a>行定义。</p>

</div>
</div>
<a class="anchor" id="gab1ec464fdb4d8c762425fc30448423f4"></a><!-- doxytag: member="sblnk.h::sblnk_node_init" ref="gab1ec464fdb4d8c762425fc30448423f4" args="(sblnk_node *node)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">static inline void sblnk_node_init </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_node</a> *&#160;</td>
          <td class="paramname"><em>node</em></td><td>)</td>
          <td><code> [inline, static]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>初始化节点 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[out]</td><td class="paramname">node</td><td>指定节点 </td></tr>
  </table>
  </dd>
</dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00456">456</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga69c71476514321a8f598476d19a98881"></a><!-- doxytag: member="sblnk.h::sblnk_iter_replace" ref="ga69c71476514321a8f598476d19a98881" args="(sblnk_root *root, sblnk_iter victim, sblnk_iter newly)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">static inline void sblnk_iter_replace </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structsblnk__root.html">sblnk_root</a> *&#160;</td>
          <td class="paramname"><em>root</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td>
          <td class="paramname"><em>victim</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td>
          <td class="paramname"><em>newly</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td><code> [inline, static]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>用新节点替换旧节点 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in,out]</td><td class="paramname">root</td><td>树根 </td></tr>
    <tr><td class="paramdir">[in,out]</td><td class="paramname">victim</td><td>受害目标节点 </td></tr>
    <tr><td class="paramdir">[out]</td><td class="paramname">newly</td><td>新节点 </td></tr>
  </table>
  </dd>
</dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00472">472</a>行定义。</p>

</div>
</div>
<a class="anchor" id="gaa1ba8199bbb594b59527ee4e8aa1adc4"></a><!-- doxytag: member="sblnk.h::sblnk_replace" ref="gaa1ba8199bbb594b59527ee4e8aa1adc4" args="(sblnk_root *victim, sblnk_root *newly)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">static inline void sblnk_replace </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structsblnk__root.html">sblnk_root</a> *&#160;</td>
          <td class="paramname"><em>victim</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="structsblnk__root.html">sblnk_root</a> *&#160;</td>
          <td class="paramname"><em>newly</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td><code> [inline, static]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>用新的树根替换旧树根 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in,out]</td><td class="paramname">victim</td><td>受害目标树根 </td></tr>
    <tr><td class="paramdir">[out]</td><td class="paramname">newly</td><td>新树根 </td></tr>
  </table>
  </dd>
</dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00500">500</a>行定义。</p>

</div>
</div>
<a class="anchor" id="gaa043d0e47f0f41e427e86d0da566ae97"></a><!-- doxytag: member="sblnk.h::sblnk_swap" ref="gaa043d0e47f0f41e427e86d0da566ae97" args="(sblnk_root *a, sblnk_root *b)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">static inline void sblnk_swap </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structsblnk__root.html">sblnk_root</a> *&#160;</td>
          <td class="paramname"><em>a</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="structsblnk__root.html">sblnk_root</a> *&#160;</td>
          <td class="paramname"><em>b</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td><code> [inline, static]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>交换两个树 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in,out]</td><td class="paramname">a</td><td>第一个树 </td></tr>
    <tr><td class="paramdir">[in,out]</td><td class="paramname">b</td><td>第二个树 </td></tr>
  </table>
  </dd>
</dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00511">511</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga196f18e5e1116a4b96e7dcee0d12db2f"></a><!-- doxytag: member="sblnk.h::sblnk_exist" ref="ga196f18e5e1116a4b96e7dcee0d12db2f" args="(sblnk_root *root, sblnk_iter itr)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">NV_API int sblnk_exist </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structsblnk__root.html">sblnk_root</a> *&#160;</td>
          <td class="paramname"><em>root</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td>
          <td class="paramname"><em>itr</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>判断一个节点是否存在于树中 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">root</td><td>树根 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">itr</td><td>指定节点 </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>返回:</b></dt><dd>int 返回结果 </dd></dl>
<dl><dt><b>返回值:</b></dt><dd>
  <table class="retval">
    <tr><td class="paramname">1</td><td>存在 </td></tr>
    <tr><td class="paramname">0</td><td>不存在 </td></tr>
  </table>
  </dd>
</dl>

<p>在文件<a class="el" href="sblnk_8c_source.html">sblnk.c</a>第<a class="el" href="sblnk_8c_source.html#l00401">401</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga6a4cbf6a15d0b9d42017614238b1e0d9"></a><!-- doxytag: member="sblnk.h::sblnk_at" ref="ga6a4cbf6a15d0b9d42017614238b1e0d9" args="(sblnk_root *root, size_t index)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">static inline <a class="el" href="struct____sblnk__node.html">sblnk_iter</a> sblnk_at </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structsblnk__root.html">sblnk_root</a> *&#160;</td>
          <td class="paramname"><em>root</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">size_t&#160;</td>
          <td class="paramname"><em>index</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td><code> [inline, static]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>得到正向索引对应的节点的迭代器 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">root</td><td>树根 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">index</td><td>指定正向索引 </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>返回:</b></dt><dd>sblnk_iter 返回迭代器 </dd></dl>
<dl class="see"><dt><b>参见:</b></dt><dd><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga93f0b4b21761403ead1bd49a0541b412" title="得到逆向索引对应的节点的迭代器">sblnk_reverse_at</a> </dd></dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00535">535</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga93f0b4b21761403ead1bd49a0541b412"></a><!-- doxytag: member="sblnk.h::sblnk_reverse_at" ref="ga93f0b4b21761403ead1bd49a0541b412" args="(sblnk_root *root, size_t index)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">static inline <a class="el" href="struct____sblnk__node.html">sblnk_iter</a> sblnk_reverse_at </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structsblnk__root.html">sblnk_root</a> *&#160;</td>
          <td class="paramname"><em>root</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">size_t&#160;</td>
          <td class="paramname"><em>index</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td><code> [inline, static]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>得到逆向索引对应的节点的迭代器 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">root</td><td>树根 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">index</td><td>指定逆向索引 </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>返回:</b></dt><dd>sblnk_iter 返回迭代器 </dd></dl>
<dl class="see"><dt><b>参见:</b></dt><dd><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga6a4cbf6a15d0b9d42017614238b1e0d9" title="得到正向索引对应的节点的迭代器">sblnk_at</a> </dd></dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00549">549</a>行定义。</p>

</div>
</div>
<a class="anchor" id="gac564d8aed1991fbf0c3f55bbb4edc709"></a><!-- doxytag: member="sblnk.h::sblnk_front" ref="gac564d8aed1991fbf0c3f55bbb4edc709" args="(sblnk_root *root)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">NV_API <a class="el" href="struct____sblnk__node.html">sblnk_iter</a> sblnk_front </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structsblnk__root.html">sblnk_root</a> *&#160;</td>
          <td class="paramname"><em>root</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>得到树的最左端节点 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">root</td><td>树根 </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>返回:</b></dt><dd>sblnk_iter 返回迭代器 </dd></dl>
<dl class="see"><dt><b>参见:</b></dt><dd><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaef991ca0f842b85f5ac97941545c025e" title="得到树的最右端节点">sblnk_back</a> </dd></dl>

<p>在文件<a class="el" href="sblnk_8c_source.html">sblnk.c</a>第<a class="el" href="sblnk_8c_source.html#l00414">414</a>行定义。</p>

</div>
</div>
<a class="anchor" id="gaef991ca0f842b85f5ac97941545c025e"></a><!-- doxytag: member="sblnk.h::sblnk_back" ref="gaef991ca0f842b85f5ac97941545c025e" args="(sblnk_root *root)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">NV_API <a class="el" href="struct____sblnk__node.html">sblnk_iter</a> sblnk_back </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structsblnk__root.html">sblnk_root</a> *&#160;</td>
          <td class="paramname"><em>root</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>得到树的最右端节点 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">root</td><td>树根 </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>返回:</b></dt><dd>sblnk_iter 返回迭代器 </dd></dl>
<dl class="see"><dt><b>参见:</b></dt><dd><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gac564d8aed1991fbf0c3f55bbb4edc709" title="得到树的最左端节点">sblnk_front</a> </dd></dl>

<p>在文件<a class="el" href="sblnk_8c_source.html">sblnk.c</a>第<a class="el" href="sblnk_8c_source.html#l00428">428</a>行定义。</p>

</div>
</div>
<a class="anchor" id="gaef5561f1a6e6865d29d001bb05b81d2f"></a><!-- doxytag: member="sblnk.h::sblnk_begin" ref="gaef5561f1a6e6865d29d001bb05b81d2f" args="(sblnk_root *root)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">static inline <a class="el" href="struct____sblnk__node.html">sblnk_iter</a> sblnk_begin </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structsblnk__root.html">sblnk_root</a> *&#160;</td>
          <td class="paramname"><em>root</em></td><td>)</td>
          <td><code> [inline, static]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>得到指向正向起始位置的迭代器 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">root</td><td>树根 </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>返回:</b></dt><dd>sblnk_iter 返回迭代器 </dd></dl>
<dl class="see"><dt><b>参见:</b></dt><dd><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gadb2f7b60f1f386ec7c25e5ad89ac5be2" title="得到指向正向终止位置的迭代器">sblnk_end</a>, <a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga9deff7b11edfb7af28fa3e50455628bd" title="得到当前迭代器的正向终止位置">sblnk_end_of</a>, <a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga9d5419a171f3b9789e64620f24f122db" title="得到指向逆向起始位置的迭代器">sblnk_rbegin</a>, <a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga1a03a537ea85b8ffdd4a8b889939df2e" title="得到指向逆向终止位置的迭代器">sblnk_rend</a> </dd></dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00579">579</a>行定义。</p>

</div>
</div>
<a class="anchor" id="gadb2f7b60f1f386ec7c25e5ad89ac5be2"></a><!-- doxytag: member="sblnk.h::sblnk_end" ref="gadb2f7b60f1f386ec7c25e5ad89ac5be2" args="()" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">static inline <a class="el" href="struct____sblnk__node.html">sblnk_iter</a> sblnk_end </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td><code> [inline, static]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>得到指向正向终止位置的迭代器 </p>
<dl class="return"><dt><b>返回:</b></dt><dd>sblnk_iter 返回迭代器，永远返回NULL </dd></dl>
<dl class="see"><dt><b>参见:</b></dt><dd><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaef5561f1a6e6865d29d001bb05b81d2f" title="得到指向正向起始位置的迭代器">sblnk_begin</a>, <a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga9deff7b11edfb7af28fa3e50455628bd" title="得到当前迭代器的正向终止位置">sblnk_end_of</a>, <a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga9d5419a171f3b9789e64620f24f122db" title="得到指向逆向起始位置的迭代器">sblnk_rbegin</a>, <a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga1a03a537ea85b8ffdd4a8b889939df2e" title="得到指向逆向终止位置的迭代器">sblnk_rend</a> </dd></dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00590">590</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga9deff7b11edfb7af28fa3e50455628bd"></a><!-- doxytag: member="sblnk.h::sblnk_end_of" ref="ga9deff7b11edfb7af28fa3e50455628bd" args="(sblnk_iter cur)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">static inline <a class="el" href="struct____sblnk__node.html">sblnk_iter</a> sblnk_end_of </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td>
          <td class="paramname"><em>cur</em></td><td>)</td>
          <td><code> [inline, static]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>得到当前迭代器的正向终止位置 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">itr</td><td>迭代器 </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>返回:</b></dt><dd>sblnk_iter 返回迭代器 </dd></dl>
<dl class="see"><dt><b>参见:</b></dt><dd><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaef5561f1a6e6865d29d001bb05b81d2f" title="得到指向正向起始位置的迭代器">sblnk_begin</a>, <a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gadb2f7b60f1f386ec7c25e5ad89ac5be2" title="得到指向正向终止位置的迭代器">sblnk_end</a> </dd></dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00602">602</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga9d5419a171f3b9789e64620f24f122db"></a><!-- doxytag: member="sblnk.h::sblnk_rbegin" ref="ga9d5419a171f3b9789e64620f24f122db" args="(sblnk_root *root)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">static inline <a class="el" href="struct____sblnk__node.html">sblnk_iter</a> sblnk_rbegin </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structsblnk__root.html">sblnk_root</a> *&#160;</td>
          <td class="paramname"><em>root</em></td><td>)</td>
          <td><code> [inline, static]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>得到指向逆向起始位置的迭代器 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">root</td><td>树根 </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>返回:</b></dt><dd>sblnk_iter 返回迭代器 </dd></dl>
<dl class="see"><dt><b>参见:</b></dt><dd><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga1a03a537ea85b8ffdd4a8b889939df2e" title="得到指向逆向终止位置的迭代器">sblnk_rend</a>, <a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga2f9706ee0e9db48af435fc2316ff8999" title="得到当前迭代器的逆向终止位置">sblnk_rend_of</a>, <a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaef5561f1a6e6865d29d001bb05b81d2f" title="得到指向正向起始位置的迭代器">sblnk_begin</a>, <a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gadb2f7b60f1f386ec7c25e5ad89ac5be2" title="得到指向正向终止位置的迭代器">sblnk_end</a> </dd></dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00614">614</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga1a03a537ea85b8ffdd4a8b889939df2e"></a><!-- doxytag: member="sblnk.h::sblnk_rend" ref="ga1a03a537ea85b8ffdd4a8b889939df2e" args="()" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">static inline <a class="el" href="struct____sblnk__node.html">sblnk_iter</a> sblnk_rend </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td><code> [inline, static]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>得到指向逆向终止位置的迭代器 </p>
<dl class="return"><dt><b>返回:</b></dt><dd>sblnk_iter 返回迭代器，永远返回NULL </dd></dl>
<dl class="see"><dt><b>参见:</b></dt><dd><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga9d5419a171f3b9789e64620f24f122db" title="得到指向逆向起始位置的迭代器">sblnk_rbegin</a>, <a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga2f9706ee0e9db48af435fc2316ff8999" title="得到当前迭代器的逆向终止位置">sblnk_rend_of</a>, <a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gaef5561f1a6e6865d29d001bb05b81d2f" title="得到指向正向起始位置的迭代器">sblnk_begin</a>, <a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#gadb2f7b60f1f386ec7c25e5ad89ac5be2" title="得到指向正向终止位置的迭代器">sblnk_end</a> </dd></dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00625">625</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga2f9706ee0e9db48af435fc2316ff8999"></a><!-- doxytag: member="sblnk.h::sblnk_rend_of" ref="ga2f9706ee0e9db48af435fc2316ff8999" args="(sblnk_iter cur)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">static inline <a class="el" href="struct____sblnk__node.html">sblnk_iter</a> sblnk_rend_of </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td>
          <td class="paramname"><em>cur</em></td><td>)</td>
          <td><code> [inline, static]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>得到当前迭代器的逆向终止位置 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">itr</td><td>迭代器 </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>返回:</b></dt><dd>sblnk_iter 返回迭代器 </dd></dl>
<dl class="see"><dt><b>参见:</b></dt><dd><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga9d5419a171f3b9789e64620f24f122db" title="得到指向逆向起始位置的迭代器">sblnk_rbegin</a>, <a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga1a03a537ea85b8ffdd4a8b889939df2e" title="得到指向逆向终止位置的迭代器">sblnk_rend</a> </dd></dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00637">637</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga6bd50f36005fd9ae83c23d0446f79b90"></a><!-- doxytag: member="sblnk.h::sblnk_next" ref="ga6bd50f36005fd9ae83c23d0446f79b90" args="(sblnk_iter cur)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">NV_API <a class="el" href="struct____sblnk__node.html">sblnk_iter</a> sblnk_next </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td>
          <td class="paramname"><em>cur</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>得到当前节点的中序后继节点 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">cur</td><td>当前节点 </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>返回:</b></dt><dd>sblnk_iter 返回后继节点，若无后继，则返回NULL </dd></dl>
<dl class="see"><dt><b>参见:</b></dt><dd><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga57c68614024a3a41fc416490d9be9f0e" title="得到当前节点的中序前驱节点">sblnk_prev</a> </dd></dl>

<p>在文件<a class="el" href="sblnk_8c_source.html">sblnk.c</a>第<a class="el" href="sblnk_8c_source.html#l00442">442</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga57c68614024a3a41fc416490d9be9f0e"></a><!-- doxytag: member="sblnk.h::sblnk_prev" ref="ga57c68614024a3a41fc416490d9be9f0e" args="(sblnk_iter cur)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">NV_API <a class="el" href="struct____sblnk__node.html">sblnk_iter</a> sblnk_prev </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td>
          <td class="paramname"><em>cur</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>得到当前节点的中序前驱节点 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">cur</td><td>当前节点 </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>返回:</b></dt><dd>sblnk_iter 返回前驱节点，若无前驱，则返回NULL </dd></dl>
<dl class="see"><dt><b>参见:</b></dt><dd><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga6bd50f36005fd9ae83c23d0446f79b90" title="得到当前节点的中序后继节点">sblnk_next</a> </dd></dl>

<p>在文件<a class="el" href="sblnk_8c_source.html">sblnk.c</a>第<a class="el" href="sblnk_8c_source.html#l00462">462</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga1bc124c75a57627dad7af5cff4588bdb"></a><!-- doxytag: member="sblnk.h::sblnk_advance" ref="ga1bc124c75a57627dad7af5cff4588bdb" args="(sblnk_iter cur, int dist)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">NV_API <a class="el" href="struct____sblnk__node.html">sblnk_iter</a> sblnk_advance </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="struct____sblnk__node.html">sblnk_iter</a>&#160;</td>
          <td class="paramname"><em>cur</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">int&#160;</td>
          <td class="paramname"><em>dist</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>给迭代器增加一段距离或减小一段距离 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">cur</td><td>迭代器 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">dist</td><td>增加的距离。正数时，表示增加；负数时，表示减小 </td></tr>
  </table>
  </dd>
</dl>
<dl class="return"><dt><b>返回:</b></dt><dd>sblnk_iter 返回新迭代器 </dd></dl>

<p>在文件<a class="el" href="sblnk_8c_source.html">sblnk.c</a>第<a class="el" href="sblnk_8c_source.html#l00389">389</a>行定义。</p>

</div>
</div>
<a class="anchor" id="ga0c4657b6e570cc5db49102522b162a80"></a><!-- doxytag: member="sblnk.h::sblnk_clear" ref="ga0c4657b6e570cc5db49102522b162a80" args="(sblnk_root *root, sblnk_pr1 erase_handler)" -->
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">static inline void sblnk_clear </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="structsblnk__root.html">sblnk_root</a> *&#160;</td>
          <td class="paramname"><em>root</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga4af164439491a4ca79da044842819995">sblnk_pr1</a>&#160;</td>
          <td class="paramname"><em>erase_handler</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td><code> [inline, static]</code></td>
        </tr>
      </table>
</div>
<div class="memdoc">

<p>清空树 </p>
<dl><dt><b>参数:</b></dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in,out]</td><td class="paramname">root</td><td>树根 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">erase_handler</td><td>移除响应函数，通常用于监视和释放节点，可以传递NULL, 表示不为删除的节点调用响应来处理 </td></tr>
  </table>
  </dd>
</dl>
<dl class="note"><dt><b>注解:</b></dt><dd>函数会为每一个被移除的节点调用erase_handler来处理节点 </dd></dl>
<dl class="see"><dt><b>参见:</b></dt><dd><a class="el" href="group___xE5_xA4_xA7_xE5_xB0_x8F_xE5_xB9_xB3_xE8_xA1_xA1_xE6_xA0_x91.html#ga9028bdd9eb8000ed59e1a512af48a37a" title="移除区域内的节点">sblnk_erases</a> </dd></dl>

<p>在文件<a class="el" href="sblnk_8h_source.html">sblnk.h</a>第<a class="el" href="sblnk_8h_source.html#l00679">679</a>行定义。</p>

</div>
</div>
</div>
<!--- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>全部</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>数据结构</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>文件</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>函数</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>变量</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>类型定义</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>宏定义</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<hr class="footer"/><address class="footer"><small>Generated at 2015年七月16日 星期四 12:00:42 for Navo Portable Library by&#160;
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.3 </small></address>
</body>
</html>
